Noether’s problem for dihedral 2-groups II

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dihedral Groups Ii

1. Abstract characterization of Dn The group Dn has two generators r and s with orders n and 2 such that srs−1 = r−1. We will show any group with a pair of generators like r and s (except for their order) admits a homomorphism onto it from Dn, and is isomorphic to Dn if it has the same size as Dn. Theorem 1.1. Let G be generated by elements a and b where an = 1 for some n ≥ 3, b2 = 1, and bab−1...

متن کامل

The local lifting problem for dihedral groups

Let G = Dp be the dihedral group of order 2p, where p is an odd prime. Let k an algebraically closed field of characteristic p. We show that any action of G on the ring k[[y]] can be lifted to an action on R[[y]], where R is some complete discrete valuation ring with residue field k and fraction field of characteristic 0. 2000 Mathematics subject Classification. Primary 14H37. Secondary: 11G20,...

متن کامل

The Neighbourhood of Dihedral 2-groups

We examine two particular constructions that derive from a 2-group G = G(·) another 2-group G(∗) for the case when G(·) is one of D2n , SD2n , Q2n . The constructions (the cyclic one and the dihedral one) have the property that x ∗ y = x · y for exactly 3/4 of all pairs (x, y) ∈ G × G. If G(◦) and G(∗) are such 2-groups that x ◦ y 6= x ∗ y for less then a quarter of all pairs (x, y) ∈ G × G, th...

متن کامل

Diameter 2 Cayley graphs of dihedral groups

We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree d. We completely determine the asymptotic behaviour of this class of graphs by showing that both limits are asymptotically d/2.

متن کامل

The L(2, 1)-labelling problem for cubic Cayley graphs on dihedral groups

A k-L(2, 1)-labelling of a graph G is a mapping f : V (G) → {0, 1, 2, . . . , k} such that |f(u)− f(v)| ≥ 2 if uv ∈ E(G) and f(u) 6= f(v) if u, v are distance two apart. The smallest positive integer k such that G admits a k-L(2, 1)-labelling is called the λ-number of G. In this paper we study this quantity for cubic Cayley graphs (other than the prism graphs) on dihedral groups, which are call...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 2005

ISSN: 0030-8730

DOI: 10.2140/pjm.2005.222.301